Combinatorial optimization - PDFSEARCH.IO - Document Search Engine

Combinatorial optimization
Results: 1158

#	Item
891	Chapter 8: Cuts and Metrics (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-01-30 08:55:10 Approximation algorithm Computational complexity theory Linear programming relaxation Mathematics Applied mathematics Combinatorial optimization Linear programming Theoretical computer science
892	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
893	Chapter 6: Randomized Rounding of Semidefinite Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:05:34 Operations research NP-complete problems Combinatorial optimization Mathematical optimization Graph coloring Semidefinite programming Approximation algorithm Randomized algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
894	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-29 13:39:05 Algorithms Combinatorial optimization Probabilistic complexity theory Randomized rounding Linear programming relaxation Randomized algorithm Mathematics Applied mathematics Theoretical computer science
895	Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Mathematical optimization Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Vertex cover NP-complete Theoretical computer science Computational complexity theory Applied mathematics
896	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:41:18 Mathematics Approximation algorithm Combinatorial optimization Optimization problem Algorithm L-reduction Theoretical computer science Computational complexity theory Applied mathematics
897	Optimal Cuts and Partitions in Tree Metrics in Polynomial Time Marek Karpinski∗ Andrzej Lingas† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 09:54:30 Combinatorial optimization NP-complete problems Network theory Dynamic programming Equations Systems engineering Tree decomposition Graph Shortest path problem Graph theory Mathematics Theoretical computer science
898	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
899	2013 IEEE 54th Annual Symposium on Foundations of Computer Science A forward-backward single-source shortest paths algorithm Uri Zwick Tel Aviv University [removed] Add to Reading List Source URL: www.dbwilson.com Language: English - Date: 2013-12-01 03:48:54 Routing algorithms Combinatorial optimization Network flow Network theory Shortest path problem Distance Graph Matching Floyd–Warshall algorithm Mathematics Graph theory Theoretical computer science
900	Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication Grey Ballard James Demmel Olga Holtz Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2012-09-10 19:42:10 NP-complete problems Combinatorial optimization Matching Tree Matrix Directed acyclic graph Graph coloring Expander code Graph theory Mathematics Theoretical computer science

UPDATE